On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex
نویسندگان
چکیده
Guillermo APARICIO, Leocadio G. CASADO2∗, Eligius M.T. HENDRIX, Boglárka G.-TÓTH, Inmaculada GARCIA 1Research Group TIC146: High Performance Computing – Algorithms University of Almería, Spain 2Informatics Department, University of Almería (ceiA3), Spain 3Department of Computer Architecture, Universidad de Málaga, Spain 4Department of Differential Equations, Budapest University of Technology and Economics Hungary e-mail: [email protected], [email protected], [email protected], [email protected], [email protected]
منابع مشابه
On Bisecting the Unit Simplex Using Various Distance Norms
The iterative bisection of the longest edge of the unit simplex generates a binary tree, where the specific shape depends on the chosen longest edges to be bisected. In global optimization, the use of various distance norms may be advantageous for bounding purposes. The question dealt with in this paper is how the size of a binary tree generated by the refinement process depends on heuristics f...
متن کاملGenerating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
In several areas like global optimization using branch-and-bound methods for mixture design, the unit n-simplex is refined by longest edge bisection (LEB). This process provides a binary search tree. For n > 2, simplices appearing during the refinement process can havemore than one longest edge (LE). The size of the resulting binary tree depends on the specific sequence of bisected longest edge...
متن کاملOn Generalized Bisection of N-Simplices
A generalized procedure of bisection of n–simplices is introduced, where the bisection point can be an (almost) arbitrary point at one of the longest edges. It is shown that nested sequences of simplices generated by successive generalized bisection converge to a singleton, and an exact bound of the convergence speed in terms of diameter reduction is given. For regular simplices, which mark the...
متن کاملHeuristics for Longest Edge Selection in Simplicial Branch and Bound
Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative refinement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. A range of possibilities arises in higher dimensions where the number of longest edges in a simplex is greater than one. The behaviour of the search and the resulting binary s...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Informatica, Lith. Acad. Sci.
دوره 26 شماره
صفحات -
تاریخ انتشار 2015